On parallel rectilinear obstacle- avoiding paths
نویسندگان
چکیده
منابع مشابه
On Parallel Rectilinear Obstacle-avoiding Paths
We give improved space and processor complexities for the problem of computing, in parallel, a data structure that supports queries about shortest rectilinear obstacleavoiding paths in the plane, where the obstacles are disjoint rectangles. That is, a query specifies any source and destination in the plane, and the data structure enables efficient processing of the query. We now can build the d...
متن کاملA Parallel Algorithm for Constructing Obstacle-Avoiding Rectilinear Steiner Minimal Trees on Multi-Core Systems
In the field of integrated circuit physical design automation, the problem of obstacle-avoiding rectilinear Steiner minimal tree (OARSMT) construction is a fundamental problem and has attracted a lot of research attention. In this paper, a parallel algorithm for constructing OARSMTs is proposed. The algorithm is based on maze routing and double front-wave expansion. Experimental results show th...
متن کاملCharacterizing Obstacle-Avoiding Paths Using Cohomology Theory
In this paper, we investigate the problem of analyzing the shape of obstacle-avoiding paths in a space. Given a d-dimensional space with holes, representing obstacles, we ask if certain paths are equivalent, informally if one path can be continuously deformed into another, within this space. Algebraic topology is used to distinguish between topologically different paths. A compact yet complete ...
متن کاملThe Steiner Ratio for Obstacle-Avoiding Rectilinear Steiner Trees
We consider the problem of finding a shortest rectilinear Steiner tree for a given set of points in the plane in the presence of rectilinear obstacles that must be avoided. We extend the Steiner ratio to the obstacle-avoiding case and show that it is equal to the Steiner ratio for the obstacle-free case.
متن کاملISPD: FOARS: FLUTE Based Obstacle-Avoiding Rectilinear Steiner Tree Construction
In this paper, we present an algorithm called FOARS for obstacle-avoiding rectilinear Steiner minimal tree (OARSMT) construction. FOARS applies a top-down approach which first partitions the set of pins into several subsets uncluttered by obstacles. Then an obstacle-avoiding Steiner tree is generated for each subset by an obstacle aware version of the rectilinear Steiner minimal tree (RSMT) alg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 1993
ISSN: 0925-7721
DOI: 10.1016/0925-7721(93)90004-p